The concept of a Z-number - A new direction in uncertain computation

نویسنده

  • Lotfi A. Zadeh
چکیده

Decisions are based on information. To be useful, information must be reliable. Basically, the concept of a Z-number relates to the issue of reliability of information. A Z-number, Z, has two components, Z=(A,B). The first component, A, is a restriction (generalized constraint) on the values which a real-valued uncertain variable, X, is allowed to take. The second component, B, is a measure of reliability (certainty) of the first component. Typically, A and B are described in a natural language. Example: (about 45 minutes, very sure). An important issue relates to computation with Z-numbers. Examples: What is the sum of (about 45 minutes, very sure) and (about 30 minutes, sure)? What is the square root of (approximately 100, likely)? Computation with Z-numbers falls within the province of Computing with Words (CW or CWW). To view the concept of a Z-number in a general perspective it is helpful to construct a conceptual framework in which there are levels of generality of uncertain computation, with each level representing a class of restrictions. The lowest level, referred to as the ground level, is the space of real numbers, R. The next level, level 1, is the space of intervals. Level 2 is the space of fuzzy numbers (possibility distributions on R) and the space of random numbers (probability distributions on R). The top level, level 3, is the space of Z-numbers. A Z-valuation is an ordered triple of the form (X,A,B) which is equivalent to the assignment of a Z-number (A,B) to X, written as X is (A,B) A collection of Z-valuations is referred to as Z-information. What is important to observe is that much of uncertain information in everyday experience is representable as Z-information. Example: Usually, Robert leaves office at about 5 pm. Usually, it takes Robert about an hour to get home from work. When does Robert get home? This information and the question may be represented as: (time of departure, about 5 pm, usually) and (time of travel, about l hour, usually); (time of arrival, ?A, ?B). Computation with Z-numbers is complicated by the fact that what is known are not the underlying probability density functions but fuzzy restrictions on such functions. To deal with computation with fuzzy restrictions what is needed is the extension principle of fuzzy logic. Basically, the extension principle is a formalism for evaluating the value of a function when what are known are not the values of arguments but restrictions on the values of arguments. * Department of EECS, University of California, Berkeley, CA 94720-1776; Telephone: 510-642-4959; Fax: 510642-1712; E-Mail: [email protected]. Research supported in part by ONR N00014-02-1-0294, Omron Grant, Tekes Grant, Azerbaijan Ministry of Communications and Information Technology Grant, Azerbaijan University of Azerbaijan Republic and the BISC Program of UC Berkeley.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Theoretical computation of the quantum transport of zigzag mono-layer Graphenes with various z-direction widths

The quantum transport computations have been carried on four different width of zigzag graphene using a nonequilibrium Green’s function method combined with density functional theory. The computed properties are included transmittance spectrum, electrical current and quantum conductance at the 0.3V as bias voltage.  The considered systems were composed from one-layer graphene sheets differing w...

متن کامل

Theoretical computation of the quantum transport of zigzag mono-layer Graphenes with various z-direction widths

The quantum transport computations have been carried on four different width of zigzag graphene using a nonequilibrium Green’s function method combined with density functional theory. The computed properties are included transmittance spectrum, electrical current and quantum conductance at the 0.3V as bias voltage.  The considered systems were composed from one-layer graphene sheets differing w...

متن کامل

Zarankiewicz Numbers and Bipartite Ramsey Numbers

The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...

متن کامل

A New Algorithm for the Deinterleaving of Radar Pulses

This paper presents a new algorithm for the deinterleaving of radar signals, based on the direction of arrival (DOA), carrier frequency (RF), and time of arrival (TOA). The algorithm is applied to classic (constant), jitter, staggered, and dwell switch pulse repetition interval (PRI) signals. This algorithm consists of two stages. In the first stage, a Kohonen neural network clusters the receiv...

متن کامل

A Note on Z-numbers

Decisions are based on information. To be useful, information must be reliable. Basically, the concept of a Z-number relates to the issue of reliability of information. A Z-number, Z, has two components, Z = (A,B). The first component, A, is a restriction (constraint) on the values which a real-valued uncertain variable, X, is allowed to take. The second component, B, is a measure of reliabilit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011